A Characterization Of The PartialStable Models For Disjunctive
نویسندگان
چکیده
We consider the partial stable model semantics for disjunctive databases with default negation as deened by Przymusinski. We give a characterization of the partial stable models of a disjunctive database P in terms of the total stable models of a suitably transformed database P tu. The transformation is based on annotating the atoms in the given database by the truth values true (\t") and undeened (\u"). Currently many fast algorithms are being developed for computing the total stable models of disjunctive databases. Based on the new characterization given in this paper, these algorithms can also be used for computing partial stable models.
منابع مشابه
Nonlinear disjunctive kriging for the estimating and modeling of a vein copper deposit
ABSTRACT Estimation of mineral resources and reserves with low values of error is essential in mineral exploration. The aim of this study is to estimate and model a vein type deposit using disjunctive kriging method. Disjunctive Kriging (DK) as an appropriate nonlinear estimation method has been used for estimation of Cu values. For estimation of Cu values and modelling of the distributio...
متن کاملA Characterization of the Partial Stable Models for Disjunctive Deductive Databases
We give a characterization of the partial stable models of a disjunctive deductive database P in terms of the total stable models of a suitably transformed database P tu. The transformation is based on annotating the atoms in the given database by the truth values true (\t") and undeened (\u"). Currently many fast algorithms are being developed for computing the total stable models of disjuncti...
متن کاملCausal models have no complete axiomatic characterization
Markov networks and Bayesian networks are effective graphic representations of the dependencies embedded in probabilistic models. It is well known that independencies captured by Markov networks (called graph-isomorphs) have a finite axiomatic characterization. This paper, however, shows that independencies captured by Bayesian networks (called causal models) have no axiomatization by using eve...
متن کاملFixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for such programs. We show that many-valued disjunctive logic programs under the semantics of minimal models, perfect models, stable models, and least model states can be unfolded to equivalent classical disjunctive logic pr...
متن کاملDisjunctive logic programs with existential quantification in rule heads
We consider disjunctive logic programs without function symbols but with existential quantification in rule heads, under the semantics of general stable models. There are at least two interesting prospects in these programs. The first is that a program can be made more succinct by using existential variables, and the second is on the potential in representing defeasible ontological knowledge by...
متن کامل